On the largest component of subcritical random hyperbolic graphs
نویسندگان
چکیده
We consider the random hyperbolic graph model introduced by [KPK+10] and then formalized [GPP12]. show that, in subcritical case α>1, size of largest component is asymptotically almost surely n1∕(2α)+o(1), thus strengthening a result [BFM15] which gave only an upper bound n1∕α+o(1).
منابع مشابه
The Largest Component in Subcritical Inhomogeneous Random Graphs
as was introduced by Bollobás, Janson and Riordan in [1]. Here S is a separable metric space and μ is a Borel probability measure on S . No relationship is assumed between x (n) i and x (n′) i . To simplify notation we shall from now on write (x1, . . . , xn) = (x (n) 1 , . . . , x (n) n ). We begin by recalling some basic definitions and assumptions from [1]. For each n let (x1, . . . , xn) be...
متن کاملThe Largest Component in a Subcritical Random Graph with a Power Law Degree Distribution
It is shown that in a subcritical random graph with given vertex degrees satisfying a power law degree distribution with exponent γ > 3, the largest component is of order n. More precisely, the order of the largest component is approximatively given by a simple constant times the largest vertex degree. These results are extended to several other random graph models with power law degree distrib...
متن کاملSusceptibility in subcritical random graphs
We study the evolution of the susceptibility in the subcritical random graph G n , p as n tends to infinity. We obtain precise asymptotics of its expectation and variance and show that it obeys a law of large numbers. We also prove that the scaled fluctuations of the susceptibility around its deterministic limit converge to a Gaussian law. We further extend our results to higher moments of the ...
متن کاملOn the Diameter of Hyperbolic Random Graphs
Large real-world networks are typically scale-free. Recent research has shown that such graphs are described best in a geometric space. More precisely, the internet can be mapped to a hyperbolic space such that geometric greedy routing performs close to optimal (Boguná, Papadopoulos, and Krioukov. Nature Communications, 1:62, 2010). This observation pushed the interest in hyperbolic networks as...
متن کاملOn the Largest Component of a Random Graph with a Subpower-law Degree Sequence in a Subcritical Phase
A uniformly random graph on n vertices with a fixed degree sequence, obeying a γ subpower law, is studied. It is shown that, for γ > 3, in a subcritical phase with high probability the largest component size does not exceed nn , εn =O(ln lnn/ lnn), 1/γ being the best power for this random graph. This is similar to the best possible n bound for a different model of the random graph, one with ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2021
ISSN: ['1083-589X']
DOI: https://doi.org/10.1214/21-ecp380